Computational Complexity

On the Computational Complexity of the Domination Game

The domination game is played on an arbitrary graph $G$ by two players, Dominator and Staller. It is known that verifying whether the game domination number of a graph is bounded by a given integer $k$ is PSPACE-complete. On the other hand, it is showed in this paper that the problem can be solved for a graph $G$ in $mathcal O(Delta(G)cdot |V(G)|^k)$ time. In the special case when $k=3$ and the...

Computational Complexity

Complex systems (CS) involve many elements that interact at different scales in time and space. The challenges in modeling CS led to the development of novel computational tools with applications in a wide range of scientific areas. The computational problems posed by CS exhibit intrinsic difficulties that are a major concern in Computational Complexity Theory. This Special Issue (SI) focused o...

Computational Complexity

Computational Complexity a k a Complexity Theory is a central eld of Com puter Science with a remarkable list of celebrated achievements as well as a very vibrant research activity The eld is concerned with the study of the intrinsic complexity of computational tasks and this study tend to aim at generality It focuses on natural computational resources and considers the e ect of limiting these ...

Computational complexity

Computational Complexity

Computational complexity theory is the study of the minimal resources needed to solve computational problems. In particular, it aims to distinguish between those problems that possess efficient algorithms (the “easy” problems) and those that are inherently intractable (the “hard” problems). Thus computational complexity provides a foundation for most of modern cryptography, where the aim is to ...